Opinion pooling on general agendas
نویسندگان
چکیده
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the agendaof relevant events forms a -algebra, an overly demanding assumption for many practical applications. We drop this assumption and explore probabilistic opinion pooling on general agendas. Our main theorems characterize linear pooling and neutral pooling for large classes of agendas, with standard results as special cases.
منابع مشابه
Probabilistic opinion pooling generalized. Part one: general agendas
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events the agenda is a -algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. On...
متن کاملOpinion pooling on general agendas: linearity or just neutrality?
In "Opinion pooling on general agendas", we characterize linear and neutral opinion pooling functions F : P ! P, where unlike in the classical opinion pooling problem the agenda X of relevant events need not form a -algebra. These characterizations are based on two conditions on the pooling function: independence and implication-preservation. The latter condition is stronger than the standard (...
متن کاملProbabilistic opinion pooling generalized Part one: General agendas1
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the agendaof relevant events forms a -algebra, hence, is closed under taking disjunctions (unions) or conjunctions (intersections) of events. This assumption is overly demanding: in practice...
متن کاملGeneralized Opinion Pooling
In this paper we analyze the problem of opinion pooling. We introduce a divergence minimization framework to solve the problem of standard opinion pooling. Our results show that various existing pooling mechanisms like LinOp and LogOp are an special case of this framework. This framework is then extended to address the problem of generalized opinion pooling. We show that this framework does sat...
متن کاملProbabilistic opinion pooling generalized. Part two: the premise-based approach
How can several individualsprobability functions on a given -algebra of events be aggregated into a collective probability function? Classic approaches to this problem usually require event-wise independence: the collective probability for each event should depend only on the individuals probabilities for that event. In practice, however, some events may be basic and others derivative, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007